Rewriting Queries for Inconsistent Data Based on Directed Join Graphs
نویسندگان
چکیده
منابع مشابه
Rewriting Queries over Summaries of Big Data Graphs
This short paper reports on the benefits that traversal queries over existing graph stores (such as RDF databases) can gain from a class of optimizations based on summaries. Summaries, also known as structural indexes, have been extensively covered in the literature (see [2] for a brief overview). Despite this, summary-based optimizations are not widely implemented. To make both graph traversal...
متن کاملAspects of Rewriting Queries on Semistructured Data
Rewriting queries using materialized views has been widely studied in recent years, although most of the work has been done based on relational models. We are interested in determining what aspects need to be considered when dealing with semistructured data. For concreteness and motivation, our underlying data model is LDAP, the well-known lightweight directory access protocol of the internet. ...
متن کاملConsistent Join Queries in Cloud Data Stores
NoSQL Cloud data stores provide scalability and high availability properties for web applications, but do not support complex queries such as joins. Developers must therefore design their programs according to the peculiarities of NoSQL data stores rather than established software engineering practice. This results in complex and error-prone code, especially when it comes to subtle issues such ...
متن کاملLCA Queries in Directed Acyclic Graphs
We present two methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is surprisingly natural and solves the all-pairs LCA problem for the input dag on n vertices and m edges in time O(nm). As a corollary, we obtain an O(n)-time algorithm for finding genealogical distances considerably improving ...
متن کاملAlgorithms for Rewriting Aggregate Queries Using Views Algorithms for Rewriting Aggregate Queries Using Views Algorithms for Rewriting Aggregate Queries Using Views Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in database applications. One of the main ideas to optimize the execution of an aggregate query is to reuse results of previously answered queries. This leads to the problem of rewriting aggregate queries using views. Due to a lack of theory, algorithms for this problem were rather ad-hoc. They were sound, but were not proven to be complete. Recently we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2013
ISSN: 1812-5638
DOI: 10.3923/itj.2013.8035.8039